On the spectrum and linear programming bound for hypergraphs
نویسندگان
چکیده
The spectrum of a graph is closely related to many parameters. In particular, the spectral gap regular which difference between its valency and second eigenvalue, widely seen an algebraic measure connectivity plays key role in theory expander graphs. this paper, we extend previous work done for graphs bipartite present linear programming method obtaining upper bound on order uniform hypergraph with prescribed distinct eigenvalues. Furthermore, obtain general whose eigenvalue bounded by given value. Our results improve Feng-Li (1996) Alon-Boppana theorems hypergraphs Dinitz-Schapira-Shahaf (2020) Moore or degree-diameter problem. We also determine largest $r$-regular $u$-uniform at most $\theta$ several parameters $(r,u,\theta)$. orthogonal arrays give structure $1$ every sufficiently large $r$. Moreover, show that generalized geometry has among all degree.
منابع مشابه
on the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولOn the linear programming bound for linear Lee codes
Based on an invariance-type property of the Lee-compositions of a linear Lee code, additional equality constraints can be introduced to the linear programming problem of linear Lee codes. In this paper, we formulate this property in terms of an action of the multiplicative group of the field [Formula: see text] on the set of Lee-compositions. We show some useful properties of certain sums of Le...
متن کاملOn the Linear Programming Bound for Lee-codes
Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. In this paper, we study the linear programming bound for codes in the Lee metric. We introduce refinements on the linear programming bound for linear codes in the Lee metric, which give a tighter bound for linear codes. We also discuss the computational aspects of the problem and introduce...
متن کاملMonotonicity of the quantum linear programming bound
The most powerful technique known at present for bounding the size of quantum codes of prescribed minimum distance is the quantum linear programming bound. Unlike the classical linear programming bound, it is not immediately obvious that if the quantum linear programming constraints are satisfiable for dimension K, that the constraints can be satisfied for all lower dimensions. We show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2022
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2022.103535